無線行動隨建即連網路上之廣播排程協定

以作者查詢圖書館館藏

、以作者查詢臺灣博碩士

、以作者查詢全國書目

、勘誤回報

、線上人數：13

、訪客IP：18.216.121.55

姓名

洪培凱(Pei-Kai Hung ) 查詢紙本館藏

畢業系所

資訊工程研究所

論文名稱

無線行動隨建即連網路上之廣播排程協定
(Broadcast Scheduling Protocols in Mobile Ad Hoc Networks)

相關論文

★ 無線行動隨建即連網路上之廣播與繞徑問題	★ 熱門電影的高效能廣播演算法
★ 無線行動隨建即連網路上之媒體存取問題	★ 使用功率調整來增加多節點封包無線網路
★ 在無線行動隨建即用網路下Geocast 之設計與實做經驗	★ 一個適用於熱門隨選視訊服務之快速排程廣播策略
★ 應用數位浮水印技術於影像之智慧財產權保護與認證	★ 在寬頻分碼多重擷取技術上分配及再分配多重正交可變展頻係數碼
★ 在無線行動隨建即連網路下支援即時多媒體傳送的媒介存取協定	★ 以樹狀結構為基礎的Scatternet建構協定
★ 在無線感應器網路中具有省電機制並且採用對角線路徑的方向性擴散	★ 隨意型無線網路上一個具有能量保存的GRID繞徑協定
★ 在無線感應器網路中具有省電機制的傳輸協定	★ 隨意型無線網路上一個具有能量保存以及平衡的繞徑協定
★ 環形藍芽網路：一個藍芽通訊網路的新拓樸及其繞徑協定	★ 在多連結無線隨意行動網路上路徑的生命週期

檔案

[Endnote RIS 格式]

[Bibtex 格式]

[相關文章]

[文章引用]

[完整記錄]

[館藏目錄]

[檢視]

[下載]

本電子論文使用權限為同意立即開放。
已達開放權限電子全文僅授權使用者為學術研究之目的，進行個人非營利性質之檢索、閱讀、列印。
請遵守中華民國著作權法之相關規定，切勿任意重製、散佈、改作、轉貼、播送，以免觸法。

摘要(中)

在一個無線行動隨建即連網路上，對網路上的各個點廣播訊息是經常發生的。一個有效的廣播通訊協定要能幫助訊息快速及可靠的散播而且要能降低多餘的再廣播。
在這篇論文當中，我們提出了三個廣播排程協定，一個是中央集中排程的協定，它需要知道整個網路各點的拓撲。其它二個是分散式的排程，他們只需要知道附近鄰居的資訊。其中一個是適用於比較靜態的網路，另一個可用於動態的網路。我們所提出的三個廣播排程協定都可以降低再廣播的比例而且能快速地完成廣播的動作。前二個協定能達到百分之百的收到率，第三個協定也有良好的收到率。在我們的論文中,我們將所提出的廣播排程協定與其它的協定就再廣播的比例、收到率及平均完成廣播的時間作詳細的比較、分析及討論。

摘要(英)

In this thesis, we consider the issue of broadcasting protocols in a mobile ad hoc network
(MANET). The objective of a broadcasting protocol is to deliver the broadcasted message
to all network nodes. Flooding in MANET has poor performance because it leads to se-rious
packets collision, contention, and redundancy, which results in the waste of limited
network bandwidth. Our goal is to design broadcasting protocols to improve the broadcast
performance. In this thesis, we propose three broadcasting protocols, one is centralized
protocol and two are distributed ones. In the three protocols, we use two basic schemes,
the ”set-covering” scheme and ”independent-transmission-set” scheme, to choose the relay
nodes and arrange a proper transmission sequence for each node. In the centralized proto-col,
we assume the topology of the network is known in advance. The centralized protocol
runs at source node and has a collision-free broadcast schedule. In the two distributed pro-tocols,
one is used for low mobility and the other one is used for topology changing rapidly.
We assume each node having the knowledge of its two-hop neighbors in both distributed
protocols. Simulation results show that the proposed broadcasting protocols can decrease
a great deal of redundant forwarding packets to save the limited network bandwidth

關鍵字(中)

★ 分散式演算法
★ 廣播協定
★ 無線行動隨建即連網路

關鍵字(英)

★ Broadcasting protocols
★ distributed algorithms

論文目次

1 Introduction 1
2 Preliminary 4
2.1 Set-Covering Scheme . . . . . ....................... 4
2.2 Independent-Transmission-Set Scheme . . . . ................ 7
3 Proposed Broadcast Scheduling Protocols 11
3.1 Protocol 1: A Centralized Protocol . . . . . . ................ 11
3.2 Protocol 2: A Distributed Broadcasting Protocol for Low Mobility ..... 15
3.3 Protocol 3: A Distributed Protocol with High Mobility . . . . . . ..... 23
4 Simulation Results 26
5 Conclusion 29

參考文獻

[1] Sze-Yao Ni, Yu-Chee Tseng, Yuh-Shyan Chen, and Jang-Ping Sheu, “The Broadcast
Storm Problem in a Mobile Ad Hoc Network,” in Proceedings of the fifth annual
ACM/IEEE international conference on Mobile computing and networking, August
1999, pp. 151—162.
[2] A. Sen and J.M. Capone, “Scheduling In Packet Radio Networks - A New Approach,”
in Proceedings of Global Telecommunications Conference, 1999, pp. 650—654.
[3] Imrich Chlamtac and Shay Kutten, “Tree-based broadcasting in multihop radio net-works,”
IEEE Transaction on Computers, pp. 1209—1225, October 1987.
[4] Wei Peng and Xi-Cheng Lu, “On the reduction of broadcast redundancy in mobile ad
hoc networks,” in Proceedings of Mobile and Ad Hoc Networking and Computing,
2000, pp. 129—130.
[5] Rajiv Ramaswami and Keshab K. Parhi, “Distributed scheduling of broadcasts in a
radio network,” in INFOCOM, 1989, vol. 2, pp. 497—504.
[6] Stefano Basagni, Danilo Bruschi, and Imrich Chlamtac, “A mobility-transparent de-terministic
broadcast mechanism for ad hoc networks,” IEEE/ACM Transactions on
Networking, vol. 7, pp. 799—807, December 1999.
[7] Chungki Lee, James E. Burns, and Mostafa H. Ammar, “Improved randomized broad-cast
protocols in multi-hop radio netwroks,” in Proceedings of International Confer-ence
on Network Protocols, October 1993, pp. 234—241.
[8] Mark L. Huson and Arunabha Sen, “Broadcast scheduling algorithms for radio net-works,”
in IEEE Military Communications Conference, July 1995, pp. 647—651.
[9] S. Ramanathan and E.L. Lloyd, “Scheduling algorithms for multihop radio networks,”
IEEE/ACM Transactions on Networking, vol. 1, pp. 166 —177, April 1993.
[10] I. Chlamtac and A. Farago, “Making transmission schedules immune to topology
changes in multi-hop packet radio networks,” IEEE/ACM Transactions on Network-ing,
vol. 2, pp. 23 —29, February 1994.
[11] Ji-Her Ju and V.O.K. Li, “An optimal topology-transparent scheduling method in
multihop packet radio networks,” IEEE/ACM Transactions on Networking, vol. 6, pp.
298 —306, June 1998.
[12] B. Hajek and G. Sasaki, “Link scheduling in polynomial time,” IEEE Transactions
on Information Theory, vol. 34, pp. 910 —917, September 1988.
[13] L. Tassiulas and A. Ephremides, “Jointly optimal routing and scheduling in packet
ratio networks,” IEEE Transactions on Information Theory, vol. 8, pp. 165 —168,
January 1992.
[14] A. Ephremides and T.V. Truong, “Scheduling broadcasts in multihop radio networks,”
IEEE Transactions on Communications, vol. 38, pp. 456 —460, April 1990.
[15] A. Sen and M.L. Huson, “A new model for scheduling packet radio networks,” in
Proceedings of Fifteenth Annual Joint Conference of the IEEE Computer Societies,
1996, vol. 3, pp. 1116 —1124.
[16] J. Sucec and I. Marsic, “An efficient distributed network-wide broadcast algorithm
for mobile ad hoc networks,” http:// citeseer.nj.nec.com/312658.html.
[17] Thomas H. Cormen and Charles E. Leisersion abd Ronald L. Rivest, Introduction To
Algorithms, The MIT Press and McGraw-Hill Book Company, 1 edition, 1990.

指導教授

許健平(Jang-Ping Sheu)

審核日期

2001-7-25

推文